An Assessment of Algorithms for Deriving Failure Deterministic Finite Automata
نویسندگان
چکیده
منابع مشابه
Failure Deterministic Finite Automata
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the...
متن کاملAn Aho-Corasick Based Assessment of Algorithms Generating Failure Deterministic Finite Automata
The Aho-Corasick algorithm derives a failure deterministic finite automaton for finding matches of a finite set of keywords in a text. It has the minimum number of transitions needed for this task. The DFA-Homomorphic Algorithm (DHA) algorithm is more general, deriving from an arbitrary complete deterministic finite automaton a language-equivalent failure deterministic finite automaton. DHA tak...
متن کاملAn Incremental Learning Algorithm for Deterministic Finite Automata using Evolutionary Algorithms
This work proposes an approach for learning Deterministic Finite Automata (DFA) that combines Incremental Learning and Evolutionary Algorithms. First, the training sequences are sorted according to its length from shortest to longest. Then, the training sequences are divided in a suitable number of groups (M) of the same size. Second, the Hybrid Adaptive Evolutionary Algorithm (HaEa) proposed b...
متن کاملAn Incremental Algorithm for Minimal Deterministic Finite Cover Automata
A fast incremental algorithm for constructing minimal DFCA for a given language is presented. Since it was shown that the DFCA for a language L can have less states than the DFA for L, this techniques seems to be the best choice for incrementally building the automaton for a large language especially when the number of states in the DFCA is significantly less than the number of states in the “e...
متن کاملNon-Deterministic Finite Cover Automata
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language using a Non-deterministic Finite Automata (NFA) may significantly reduce the number of required states. The combined power of the succinctness of the representation of fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: South African Computer Journal
سال: 2017
ISSN: 2313-7835,1015-7999
DOI: 10.18489/sacj.v29i1.456